On the colored Tutte polynomial of a graph of bounded treewidth
نویسنده
چکیده
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k -sum of two graphs generalizes to a colored Tutte polynomial. Consequently an algorithm of A. Andrzejak [Discrete Math. 190 (1998), 39-54] may be directly adapted to compute the colored Tutte polynomial of a graph of bounded treewidth in polynomial time. This result has also been proven by J. A. Makowsky [Discrete Appl. Math. 145 (2005), 276-290], using a di¤erent algorithm based on logical techniques.
منابع مشابه
On the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملBounded Treewidth Graphs – A Survey German Russian Winter School St. Petersburg, Russia
This survey gives an introduction to the class of bounded treewidth graphs, for which many NP-complete problems can be solved efficiently. The concept of a tree decomposition is explained. Subclasses of the bounded treewidth graphs are identified. Results about finding tree decompositions are summarized. Some problems which are efficiently solvable on bounded treewidth graphs are listed and alg...
متن کاملColored Tutte Polynomials and Kauuman Brackets for Graphs of Bounded Tree Width
Jones polynomials and Kauuman polynomials are the most prominent invariants of knot theory. For alternating links, they are easily computable from the Tutte polynomials by a result of Thistlethwaite (1988), but in general one needs colored Tutte polynomials, as introduced by Bollobas and Riordan (1999). Knots and links can be presented as labeled planar graphs. The tree width of a link L is dee...
متن کاملComputing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp O(n) ) for compu...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 154 شماره
صفحات -
تاریخ انتشار 2006